a model and extended algorithm for solving an inventory control problem with transportation costs

Authors

فریبرز جولای

رضا توکلی مقدم

جعفر رزمی

پدرام صهبا

abstract

in this paper, a supplier-retailer transportation system is investigated as a two-echelon environment. there is a single location in each echelon; the unique supplier at the first echelon has to replenish the retailer's warehouse at the second echelon. by the way, the shortage situation should be avoided. for this situation, a model is provided based on the traditional eoq model. the inventory costs, ordering costs, transportation cost, etc. are considered in this model. multistage shipment during each ordering period with a specific number of vehicles is allowed in the proposed model. the model's decisions involved in managing the system include design decision (i.e., optimized number of required vehicles), as well as operation decision (i.e., optimized order quantity and number of trips and transportation stages). a solution algorithm is proposed for the proposed model and implemented with c#.net which is available and applicable on the website, namely www.pedramsahba.com. a numerical example and sensitivity analysis are presented for exposing the model and algorithm capability and then verifying and validating the model.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An Extended Compact Genetic Algorithm for Milk Run Problem with Time Windows and Inventory Uncertainty

In this paper, we introduce a model  to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...

full text

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

an extended compact genetic algorithm for milk run problem with time windows and inventory uncertainty

in this paper, we introduce a model  to optimization of milk run system that is one of vrp problem with time window and uncertainty in inventory. this approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .the problem is formulated as a robust optimization problem. since the resulted problem illustrates that grows up ...

full text

A New Model for Transportation Problem with Qualitative Data

 In today’s highly competitive market, the pressure on organizations to find a better way to create and deliver value to customers is mounting. The decision involves many quantitative and qualitative factors that may be conflicting in nature. Here, we present a new model for transportation problem with consideration of quantitative and qualitative data. In the model, we quantify the qua...

full text

An integrated model for solving the multiple criteria ABC inventory classification problem

In this paper, we present an integrated version of the Ng model and Zhou and Fan model [W. L. Ng,A simple classifier for multiple criteria ABC analysis, European Journal of Operation Research, 177(2007) 344-353; P. Zhou & L. Fan, A note on multi-criteria ABC inventory classification usingweighted linear optimization, European Journal of Operation Research, 182 (2007) 1488-1491]. Themodel that N...

full text

AN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM

Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...

full text

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023